/*
 * @Author: your name
 * @Date: 2024-06-14 12:40:57
 * @LastEditTime: 2024-06-14 12:42:53
 * @LastEditors: your name
 * @Description: In User Settings Edit
 * @FilePath: \.leetcode\746.使用最小花费爬楼梯.cpp
 */
/*
 * @lc app=leetcode.cn id=746 lang=cpp
 *
 * [746] 使用最小花费爬楼梯
 */

// @lc code=start
class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        vector<int> dp(cost.size()+1);
        dp[0] = 0;
        dp[1] = 0;
        for(int i = 2; i <= cost.size(); i++){
            dp[i] = min(dp[i-1]+cost[i-1], dp[i-2]+cost[i-2]);
        }
        return dp[cost.size()];
    }
};
// @lc code=end

